Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

CUET PG MCA
Previous Year Questions

CUET PG MCA Previous Year Questions (PYQs)

CUET PG MCA Computer PYQ

Qus : 1

Given the following truth table:

A	B	X
0	0	1
0	1	0
1	0	0
1	1	0

Which of the following Boolean functions does it represent?

1
2
3
4
Go to Discussion

Solution

Qus : 2

The product of two four bit positive binary numbers 1011 and 0011 is

1
2
3
4
Go to Discussion

Solution

Qus : 3

The simplified form of the Boolean Expression AB+AB' is ______

1
2
3
4
Go to Discussion

Solution

Qus : 4

Representation of -11 in sign and magnitude is :

1
2
3
4
Go to Discussion

Solution

Qus : 5

1001 is 2's complement representation of _______

1
2
3
4
Go to Discussion

Solution

Qus : 6

Match List I with List II :

LIST I	LIST II
A. (x+y)'	I. 1
B. x+1	II. x'+y'
C. (xy)'	III. x'.y'
D. x+0	IV. x

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Qus : 7

Consider implementation of database. Among the following options, choose the most appropriate data structure for this

1
2
3
4
Go to Discussion

Solution

Qus : 8

Mach the List - 1 with List - II

List - I	List - II
(A)Asynchronous	(I) A pulse that cause a logic device to be activated or change state
(B)Trigger	(II) The operation is not executed in step with the clock
(C) J-K Flip flop	(III) Flip flop and atleast set, reset toggle and hold modes of operation
(D) D Flip flop	(IV) Flip flop with atleast set and rest modes of operations.

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Qus : 9

Consider a system with 1K pages and 512 frames and each page is of size 2 KB. How many bits are required to represent the virtual address space memory:

1
2
3
4
Go to Discussion

Solution

To determine the number of bits required to represent the virtual address space:

Number of pages = 1K = $2^10$ .
Page size = 2 KB = $2^{11}$ bytes.
Virtual address space = Number of pages × Page size = $2^{10}×2^{11}=2^{21}$ bytes.
Bits required =21 bits.

Qus : 10

Each node is having a successor node in ________________:

1
2
3
4
Go to Discussion

Solution

Qus : 11

How does the number of page frames affect and number of page faults for a given memory access pattern in FIFO page replacement algorithm?

1
2
3
4
Go to Discussion

Solution

Qus : 12

Arrange the following in increasing order of their per unit cost.

(A) DRAM

(B) Magnetic disk

(D) SRAM

(E) Magnetic tape

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Qus : 13

Match List – I with List – II

List - I	List - II
(A) Flash Memory	(I) Oldest and Slowest
(B) PMOS	(II) Used in large scale integration (LSI)
(C) NMOS	(III) Least power consumption
(D) CMOS	(IV) Non volatile RAM which is powered continuously

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Flash Memory (A):
- Flash memory is a type of non-volatile RAM that retains data even when power is turned off. It is often used in devices like USB drives, SSDs, and memory cards.
PMOS (B):
- PMOS (P-type Metal-Oxide-Semiconductor) is one of the oldest and slowest types of MOSFET technology. It was widely used in early integrated circuits.
NMOS (C):
- NMOS (N-type Metal-Oxide-Semiconductor) is commonly used in large-scale integration (LSI) due to its faster switching speed compared to PMOS.
CMOS (D):
- CMOS (Complementary Metal-Oxide-Semiconductor) is known for its low power consumption because it uses both PMOS and NMOS transistors in a complementary way, reducing static power dissipation.

Qus : 14

Consider a completely skewed (left / right) binary search tree with n elements. What is the worst case time complexity of searching an element in this tree?

1
2
3
4
Go to Discussion

Solution

Qus : 15

If we want to find last node of a singly linked list then the correct coding is

1
2
3
4
Go to Discussion

Solution

Qus : 16

The function represented by the k-map given below is

1
2
3
4
Go to Discussion

Solution

Qus : 17

Let A’ represent complement of A. Which of the following boolean expressions is/are true?

(A) A +AB=A

(B) (A+B)'= A'B'

(D) (AB)'= A'+B'

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Qus : 18

A logic circuit, that can odd two 1-bit numbers and produce output for sum and carry but cannot handle carry, input, is called ____________.

1
2
3
4
Go to Discussion

Solution

Qus : 19

On a system using simple segmentation, following is the segment table:

Segment	Limit	Base
0	500	1000
1	200	2000
2	300	2500
3	100	1700

What is the physical address for the logical address 2, 212?

1
2
3
4
Go to Discussion

Solution

Qus : 20

Arrange the following in the increasing order of their asympotic complexities:

(A) Insertion sort (best case)

(B) Bubble sort (worst case)

(D) Merge sort (worst case)

1
2
3
4
Go to Discussion

Solution

Qus : 21

Decreasing the RAM of a computer typically leads to which of the following outcomes ?

1
2
3
4
Go to Discussion

Solution

Qus : 22

We can say that a schedule is conflict serializable?

(1) If a schedule T can be transformed into a serial schedule U by a series of swaps of conflicting operations.

(2) If a schedule T can be transformed into a serial schedule U by a series of swaps of nonconflicting operations.

(3) If a schedule T can be transformed into a non serial schedule U by a series of swaps of conflicting operations.

(4) If a schedule T can be transformed into a non serial schedule U by a series of swaps of non conflicting operations.

1
2
3
4
Go to Discussion

Solution

Qus : 23

The following integers are needed to be stored in ascending order using bubble sort.

5, 8, 22, 18, 1

Following are the results of various passes during the sorting process.

1
2
3
4
Go to Discussion

Solution

Qus : 24

The range of integers that can be represented by a 2’s complements number system is ________.where is n is number of bits in number.

1
2
3
4
Go to Discussion

Solution

Qus : 25

Given

$\sqrt{(224)_r}=(13)_r$ where r is the radix. The value of r is _________________.

1
2
3
4
Go to Discussion

Solution

Qus : 26

What are the ways to implement a priority Queue?

(A) Arrays

(B) Fibonacci tree

(D) Linked list

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Ways to Implement a Priority Queue

The correct answer is:

(A) Arrays, (C) Heap Data Structure, and (D) Linked List

Explanation:

Arrays:
- Unsorted Array: Insertion is O(1), Deletion is O(n).
- Sorted Array: Insertion is O(n), Deletion is O(1).
Heap Data Structure:
- Binary heaps are commonly used for efficient implementation.
- Insertion and Deletion take O(log n) time.
Linked List:
- Can be implemented as sorted or unsorted.
- Efficiency depends on the choice of implementation.

Why not Fibonacci Tree?

Fibonacci trees are not used directly for priority queues. However, Fibonacci heaps (a separate data structure) can implement priority queues efficiently.

Qus : 27

An operating system cotains 4 user processor each requiring 5 units of resource R. The minimum number ofrequired units of R such that no deadlock will every occur is

1
2
3
4
Go to Discussion

Solution

Minimum Number of Required Units of Resource R to Prevent Deadlock

Number of processes (P) = 4 Maximum demand per process = 5 units
Formula: R≥(P−1)×max demand+1

Substituting values:
R≥(4−1)×5+1=3×5+1=15+1=16
Minimum required units of resource R = 16

Qus : 28

Given below are two statements:

Statement I: 011010 is 2's complement representation of -37.

Statement II: 111₍₈₎ is octal representation of 73.

In the light of the above statements, choose the most appropriate answer from the options given below :

1
2
3
4
Go to Discussion

Solution

Qus : 29

The current allocation and Maximum requirement of different types of resources for four processes are given below:

Consider the following four statements.
(A) P2 → P4 → P1 → P3 is a safe sequence
(B) P4 → P2 → P1 → P3 is a safe sequence
(C) P4 → P2 → P3 → P1 is a safe sequence
(D) P1 → P4 → P2 → P3 is a safe sequence

Identify correct statements from the given options.

1
2
3
4
Go to Discussion

Solution

Banker's Algorithm Solution

Step 1: Need Matrix

The Need Matrix is calculated as:

Need = Max - Allocation

Process	R1	R2	R3
P1	4	5	2
P2	1	0	1
P3	6	0	0
P4	0	1	0

Step 2: Initial Available Resources

The Available resources at the start are:

R1 = 4
R2 = 4
R3 = 5

Step 3: Evaluate Each Sequence

Sequence (A): P2 → P4 → P1 → P3

P2: Need = [1, 0, 1], Available = [4, 4, 5]. Allocate resources. New Available = [7, 5, 7].
P4: Need = [0, 1, 0], Available = [7, 5, 7]. Allocate resources. New Available = [10, 7, 9].
P1: Need = [4, 5, 2], Available = [10, 7, 9]. Allocate resources. New Available = [14, 8, 11].
P3: Need = [6, 0, 0], Available = [14, 8, 11]. Allocate resources. New Available = [17, 12, 14].

Result: Sequence (A) is valid.

Sequence (B): P2 → P1 → P3 → P4

P2: Need = [1, 0, 1], Available = [4, 4, 5]. Allocate resources. New Available = [7, 5, 7].
P1: Need = [4, 5, 2], Available = [7, 5, 7]. Allocate resources. New Available = [11, 6, 9].
P3: Need = [6, 0, 0], Available = [11, 6, 9]. Allocate resources. New Available = [14, 10, 12].
P4: Need = [0, 1, 0], Available = [14, 10, 12]. Allocate resources. New Available = [17, 12, 14].

Result: Sequence (B) is valid.

Sequence (C): P4 → P2 → P3 → P1

P4: Need = [0, 1, 0], Available = [4, 4, 5]. Allocate resources. New Available = [7, 6, 7].
P2: Need = [1, 0, 1], Available = [7, 6, 7]. Allocate resources. New Available = [10, 7, 9].
P3: Need = [6, 0, 0], Available = [10, 7, 9]. Allocate resources. New Available = [14, 8, 11].
P1: Need = [4, 5, 2], Available = [14, 8, 11]. Allocate resources. New Available = [17, 12, 14].

Result: Sequence (C) is valid.

Sequence (D): P1 → P4 → P2 → P3

P1: Need = [4, 5, 2], Available = [4, 4, 5]. Cannot proceed as Need > Available.

Result: Sequence (D) is invalid.

Final Answer:

Safe Sequences: (A), (B), (C)

Invalid Sequence: (D)

Qus : 30

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R.

Assertion A : Binary information is represented in digital in terms of 'zeros' and 'ones.

Reason R: Digital computers are electronic devices, which operate using electrical voltages.

In the light of the above statements, choose the most appropriate answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Qus : 31

Match List – I with List – II

List - I (Algorithms)	List - II (Complexity)
(A) Bellman - Ford algorithm (with adjacencylist representation)	(I) $O(\|V\|^2)$
(B) Dijkstra Algorithm	(II) O((V+E) logV)
(C) Prim’s Algorithm	(III) O(mn)
(D) Topological sorting (with adjacency list representation)	(IV) O(m+n)

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Qus : 32

Which of the following storage hardwares can be used as a back-up device?

A. HDD

B. ROM

C. RAM

D. Cache

E. Magnetic Tape

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Qus : 33

Consider the following statements

(A) RAM is a combinational circuit

(B) RAM is sequential circuit

(D) PLA is a sequential circuit

1
2
3
4
Go to Discussion

Solution

Qus : 34

The idea of cache memory is based on the which of the following?

1
2
3
4
Go to Discussion

Solution

Qus : 35

Which of the following is not an applicaiton of Stack?

1
2
3
4
Go to Discussion

Solution

Qus : 36

In a processor, while executing an instruction

A. Programme Counter is used to hold the address of next instruction.

B. Instruction register holds the instruction for execution.

C. Memory Address Register is used to perform address translation.

D. Memory Data Register is used to perform data operation

E. Clock generates control signals.

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Qus : 37

How many child processes will be created by following fork() system call?

fork();

1
2
3
4
Go to Discussion

Solution

Given: 4 calls to fork().

Formula: Total processes created = 2^n

Calculation:

Total processes = 2^4 = 16
Child processes = 16 - 1 = 15

Answer: 15 child processes

Qus : 38

Match List – I with List – II

List - I	List - II
(A) Critical Region	(I) Circular Wait
(B) Working Set	(II) Condition variable
(C) Deadlock	(III) Principle of locality
(D) Wait/Signal	(IV) Mutual Exclusion

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

Solution

Matching List-I with List-II:

List - I	List - II	Explanation
Critical Region	Mutual Exclusion (IV)	The critical region ensures mutual exclusion, allowing only one process to access a shared resource at a time.
Working Set	Principle of Locality (III)	The working set is a concept used in memory management, based on the principle of locality to predict the set of pages a process is likely to use.
Deadlock	Circular Wait (I)	One of the necessary conditions for a deadlock is circular wait, where processes are waiting for resources held by one another in a circular chain.
Wait/Signal	Condition Variable (II)	The wait and signal operations are synchronization mechanisms associated with condition variables in multi-threaded environments.

Final Answer:

(A) → (IV), (B) → (III), (C) → (I), (D) → (II)

Qus : 39

Consider the following tree. This is a / a _________________

1
2
3
4
Go to Discussion

Solution

Qus : 40

In a computer if the page fault service time is 10 ms and average memory access time is 30 ns. If one page faultis generated for every 106 memory accesses. What is the effective access time for the memory?

1
2
3
4
Go to Discussion

Solution

Qus : 41

The simplified form of Boolean expression:

$\overline{A}BC+ABC$ is

1
2
3
4
Go to Discussion

Solution

CUET PG MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

CUET PG MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

Feedback

Info.

Information

Aspire's Library

CUET PG MCA Previous Year Questions (PYQs)

CUET PG MCA Computer PYQ

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Ways to Implement a Priority Queue

Explanation:

Why not Fibonacci Tree?

Solution

Solution

Solution

Banker's Algorithm Solution

Step 1: Need Matrix

Step 2: Initial Available Resources

Step 3: Evaluate Each Sequence

Sequence (A): P2 → P4 → P1 → P3

Sequence (B): P2 → P1 → P3 → P4

Sequence (C): P4 → P2 → P3 → P1

Sequence (D): P1 → P4 → P2 → P3

Final Answer:

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Answer: 15 child processes

Solution

Final Answer:

Solution

Solution

Solution

CUET PG MCA

CUET PG MCA

Info.

Confirm Delete

Edit